Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z
نویسندگان
چکیده
Bounds on the range of random graph homomorphism into Z, and the maximal height difference of the Gaussian random field, are presented.
منابع مشابه
Upper Bounds on the Height Diierence of the Gaussian Random Field and the Range of Random Graph Homomorphisms into Z
Bounds on the range of random graph homomorphism into Z, and the maximal height diierence of the Gaussian random eld, are presented.
متن کاملOn Random Graph Homomorphisms into Z
Given a bipartite connected finite graph G=(V, E) and a vertex v0∈V, we consider a uniform probability measure on the set of graph homomorphisms f: V→Z satisfying f(v0)=0. This measure can be viewed as a Gindexed random walk on Z, generalizing both the usual time-indexed random walk and tree-indexed random walk. Several general inequalities for the G-indexed random walk are derived, including a...
متن کاملOn Moments of the Concomitants of Classic Record Values and Nonparametric Upper Bounds for the Mean under the Farlie-Gumbel-Morgenstern Model
In a sequence of random variables, record values are observations that exceed or fall below the current extreme value.Now consider a sequence of pairwise random variables {(Xi,Yi), i>=1}, when the experimenter is interested in studying just thesequence of records of the first component, the second component associated with a record value of the first one is termed the concomitant of that ...
متن کاملFixed point approach to the Hyers-Ulam-Rassias approximation of homomorphisms and derivations on Non-Archimedean random Lie $C^*$-algebras
In this paper, using fixed point method, we prove the generalized Hyers-Ulam stability of random homomorphisms in random $C^*$-algebras and random Lie $C^*$-algebras and of derivations on Non-Archimedean random C$^*$-algebras and Non-Archimedean random Lie C$^*$-algebras for the following $m$-variable additive functional equation: $$sum_{i=1}^m f(x_i)=frac{1}{2m}left[sum_{i=1}^mfle...
متن کاملOn the edge geodetic and edge geodetic domination numbers of a graph
In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 17 شماره
صفحات -
تاریخ انتشار 2000